/*
 * To change this template, choose Tools | Templates
 * and open the template in the editor.
 */
package Util;

import java.util.Collections;
import java.util.Comparator;
import java.util.LinkedHashMap;
import java.util.LinkedList;
import java.util.List;
import java.util.Map;

/**
 *
 * @author Atul
 */
public class MapUtil {

    public static <K, V extends Comparable<? super V>> LinkedHashMap<K, V> sortByValue(Map<K, V> map) {
        List<Map.Entry<K, V>> list =
                new LinkedList<Map.Entry<K, V>>(map.entrySet());
        Collections.sort(list, new Comparator<Map.Entry<K, V>>() {

            public int compare(Map.Entry<K, V> o1, Map.Entry<K, V> o2) {
                return (o1.getValue()).compareTo(o2.getValue());
            }
        });

        LinkedHashMap<K, V> result = new LinkedHashMap<K, V>();
        for (Map.Entry<K, V> entry : list) {
            result.put(entry.getKey(), entry.getValue());
        }
        return result;
    }

    public static <K, V> LinkedHashMap<K, V> subMap(LinkedHashMap<K, V> map, int fromIndex, int toIndex) {
        LinkedHashMap<K, V> result = new LinkedHashMap<K, V>();

        int i = 0;
        for (Map.Entry<K, V> entry : map.entrySet()) {
            if (i >= fromIndex && i < toIndex) {
                result.put(entry.getKey(), entry.getValue());
            }
            i++;
        }

        return result;
    }
    
    public static <K, V extends Comparable<? super V>> Map<K, V> processMap(Map<K, V> map,int lastIndex)
    {
        return subMap(sortByValue(map),0,lastIndex);
    }
}
